翻訳と辞書 Words near each other ・ Hróa þáttr heimska ・ Hrólfr Gautreksson ・ Hrólfr Kraki ・ Hrólfs saga Gautrekssonar ・ Hrólfs saga kraka ・ Hrómundar saga Gripssonar ・ Hrómundartindur ・ Hrútafjörður ・ Hrčava ・ Hrčeľ ・ Hrōþ ・ Hrœrekr Ringslinger ・ Hrženica ・ HS ・ HS Ad ・ HS algorithm ・ Hs and Ts ・ HS Marechiaro ・ HS postcode area ・ HS Produkt ・ HS Produkt VHS ・ HS Sharath ・ HS-10 Warhawks ・ HS-11 ・ HS-121 ・ HS-127 ・ HS-333 ・ HS-9 ・ HS/Link ・ HS1 (disambiguation) Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク HS algorithm ： ウィキペディア英語版 HS algorithm The HS Algorithm is named after Dan Hirschberg and J. B. Sinclair. It is a distributed algorithm designed for the Leader Election problem in a Synchronous Ring. The algorithm requires the use of unique IDs (UID) for each process. The algorithm works in phases and sends its UID out in both directions. The message goes out a distance of 2Phase Number hops and then the message heads back to the originating process. While the messages are heading "out" each receiving process will compare the incoming UID to its own. If the UID is greater than its own UID then it will continue the message on. Otherwise if the UID is less than its own UID, it will not pass the information on. At the end of a phase, a process can determine if it will send out messages in the next round by if it received both of its incoming messages. Phases continue until a process receives both of its out messages, from both of its neighbors. At this time the process knows it is the largest UID in the ring and declares itself the leader. ==References== * Nancy A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, Inc. (1996) pp. 31-35. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「HS algorithm」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.